Learning Multi - Linear Representations for Efficient

نویسنده

  • RAJHANS SAMDANI
چکیده

We examine the class of multi-linear representations (MLR) for expressing probability distributions over discrete variables. Recently, MLRs have been considered as intermediate representations that facilitate inference in distributions represented as graphical models. We show that MLR is an expressive representation of discrete distributions and can be used to concisely represent classes of distributions which have exponential size in other commonly used representations, while supporting probabilistic inference in time that is linear in the size of the representation. Our key contribution is presenting techniques for learning bounded-size distributions represented using MLRs, which support efficient probabilistic inference. We then demonstrate experimentally that the MLR representations we learn supports accurate and very efficient inference.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Learning of Domain-invariant Image Representations

We present an algorithm that learns representations which explicitly compensate for domain mismatch and which can be efficiently realized as linear classifiers. Specifically, we form a linear transformation that maps features from the target (test) domain to the source (training) domain as part of training the classifier. We optimize both the transformation and classifier parameters jointly, an...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method

Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as matrix completion, collaborative filtering, multi-task learning, transfer learning, network prediction and zero-shot learning. In this work we analyze kernel-based methods for pairwise learning, with a particular focu...

متن کامل

On solving possibilistic multi- objective De Novo linear programming

Multi-objective De Novo linear programming (MODNLP) is problem for designing optimal system by reshaping the feasible set (Fiala [3] ). This paper deals with MODNLP having possibilistic objective functions coefficients. The problem is considered by inserting possibilistic data in the objective functions coefficients. The solution of the problem is defined and established under the using of effi...

متن کامل

UNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS

In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009